Exploration of Periodically Varying Graphs
نویسندگان
چکیده
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers. These graphs naturally model highly dynamic infrastructure-less networks such as public transports with fixed timetables, low earth orbiting (LEO) satellite systems, security guards’ tours, etc. We establish necessary conditions for the problem to be solved. We also derive lower bounds on the amount of time required in general, as well as for the PV graphs defined by restricted classes of carriers movements: simple routes, and circular routes. We then prove that the limitations on computability and complexity we have established are indeed tight. We do so constructively presenting two worst case optimal solution algorithms, one for anonymous systems, and one for those with distinct nodes ids.
منابع مشابه
On the exploration of time-varying networks
We study the computability and complexity of the exploration problem in a class of highly dynamic networks: carrier graphs, where the edges between sites exist only at some (unknown) times defined by the periodic movements of mobile carriers among the sites. These graphs naturally model highly dynamic infrastructure-less networks such as public transportswith fixed timetables, lowearth orbiting...
متن کاملUsing Graphs for Fast Error Term Approximation of Time-varying Datasets
Session 1: Time-Varying, High Dimensional and Spatial Visualization Chair (Bill Ribarsky) 11h00-11h30 Using Graphs for Fast Error Term Approximation of Time-varying Datasets Christof Nuber, Eric C. LaMar, Valerio Pascucci, Bernd Hamann, Kenneth I. Joy 11h30-12h00 Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets Jing Yang, Matthew O. Ward, Elke A. Rundensteine...
متن کاملPersistent Homology Guided Exploration of Time-Varying Graphs
Topological data analysis is an emerging area in exploratory data analysis and data mining. Its main tool, persistent homology, has become a popular technique to study the structure of complex, high-dimensional data. In this paper, we propose a novel method using persistent homology to quantify the perturbation of features that occur in time-varying graphs. Specifically, we slice the graph data...
متن کاملInteractive Poster: Exploring Time-Varying Hypergraphs
Time-varying graphs occur frequently in many applications, e.g., as social networks or as ad-hoc computer networks. This interactive poster focuses on hypergraphs (graphs with edges that connect more than two nodes) and introduces a novel overview+detail concept for their visual exploration. It combines a bipartite view for detailed inspection and comparison with the computation of structural m...
متن کاملFractional Order Generalized Thermoelastic Functionally Graded Solid with Variable Material Properties
In this work, a new mathematical model of thermoelasticity theory has been considered in the context of a new consideration of heat conduction with fractional order theory. A functionally graded isotropic unbounded medium is considered subjected to a periodically varying heat source in the context of space-time non-local generalization of three-phase-lag thermoelastic model and Green-Naghdi mod...
متن کامل